Just-in-time Compilation for Generalized Parsing
نویسندگان
چکیده
Parsing syntactically extensible languages requires generalized parsers which are slow to generate for repeatedly changing grammars. This situation is similar to the execution of dynamic languages like JavaScript, suggesting that we can appropriate technology from that field to use in just-in-time compiled parsers. We implement two just-intime compiling grammar interpreters, a simple one and a generalized LL parser, using a research prototype of a programming language implementation framework called Truffle. Exploratory performance experiments suggests that appropriating just-in-time compilation technology for parsers is not only possible, but close to being competitive for generalized parsing and might even surpass handwritten recognizers in some cases.
منابع مشابه
Just-in-Time Grammar
In this paper, we attempt to explain why rule-based syntactic analysis systems have not so far worked as well as they could. This will motivate our approach, which is based on a narrowing of the focus of the rules, resulting in more accurate, less ambiguous, more efficient parsing and relative ease of acquisition. These rules are word-based, rather than construction-based, and are used to produ...
متن کاملSLING: A framework for frame semantic parsing
We describe SLING, a framework for parsing natural language into semantic frames. SLING supports general transition-based, neural-network parsing with bidirectional LSTM input encoding and a Transition Based Recurrent Unit (TBRU) for output decoding. The parsing model is trained end-to-end using only the text tokens as input. The transition system has been designed to output frame graphs direct...
متن کاملJust in Time Control of Constrained ( max , +)-Linear Systems
This paper deals with just in time control of (max,+)-linear systems. The output tracking problem, considered in previous studies, is generalized by considering additional constraints in the control objective. The problem is formulated as an extremal fixed point computation. This control is applied to timetables computation for urban bus networks.
متن کاملParse Table Composition Separate Compilation and Binary Extensibility of Grammars
Module systems, separate compilation, deployment of binary components, and dynamic linking have enjoyed wide acceptance in programming languages and systems. In contrast, the syntax of languages is usually defined in a non-modular way, cannot be compiled separately, cannot easily be combined with the syntax of other languages, and cannot be deployed as a component for later composition. Grammar...
متن کاملImplementing Hpsg with Modular Tools for Fast Compiling and Parsing
We describe a modular HPSG implementation , based on a set of tools rather than a single monolithic engine such as ALE. With these tools we can use techniques for much faster compiling and parsing than ALE. We use two-stage grammar compilation with partial execution and a concurrent process implementation of the chart for fast parsing. We compile HPSG lexical rules into Prolog rules used at run...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014